A Modified Leader Election Algorithm for MANET

نویسنده

  • Smita Bhoir
چکیده

Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network because of their concurrent and frequently changing wireless link formation and removal, network partitioning and disconnections, limited bandwidth and energy and highly variable message delay. An election algorithm elects a leader to coordinate and organize a task in distributed systems that includes MANET also. In the case of a leader node departure or failure, nodes detecting the non-availability of the leader initiate a leader election process to select a new leader. This paper presents a comparative analysis of various leader election algorithms and a new leader election algorithm in analytical way which considers factors such as node’s position, time complexity, message complexity, battery life and security. KeywordsDistributed System, Mobile Ad Hoc Networks, Leader Election

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Networks

Mobile Ad Hoc networks (MANET), distinct from traditional distributed systems, are dynamic and selforganizing networks. MANET requires a leader to coordinate and organize tasks. The challenge is to have the right election algorithm that chooses the right leader based on various factors in MANET. In this paper, we analyze four leader election algorithms used in mobile Ad Hoc Networks. Factors co...

متن کامل

TWO ALGORITHMS FOR LEADER ELECTION AND NETWORK SIZE ESTIMATION IN MOBILE AD HOC NETWORKS A Thesis by NICHOLAS

Two Algorithms for Leader Election and Network Size Estimation in Mobile Ad Hoc Networks. (December 2004) Nicholas Gerard Neumann, B.S., Texas A&M University Chair of Advisory Committee: Dr. Jennifer Welch We develop two algorithms for important problems in mobile ad hoc networks (MANETs). A MANET is a collection of mobile processors (“nodes”) which communicate via message passing over wireless...

متن کامل

Stochastic Restricted Broadcast Process Theory

We provide a framework for modeling and analyzing both qualitative and quantitative aspects of mobile ad hoc network (MANET) protocols above the data-link layer. We extend Restricted Broadcast Process Theory [11,9]: delay functions are assigned to actions, while the semantics captures the interplay of a MANET protocol with stochastic behavior of the data-link and physical layer, and the dynamic...

متن کامل

Secure Leader Election Algorithm Optimized for Power Saving Using Mobile Agents for Intrusion Detection in MANET

11.15AM – 12.00Noon Keynote VII (Skype) Cognitive Group-Based Collaborative Sensor Network for Sensing and Monitoring the Water Environment (Skype Presentation) Dr. Jaime Lloret Mauri, Associate Professor, Department of Communications, Polytechnic University of Valencia, Spain 12.00Noon – 01.00PM Keynote VIII Data Center Networking Dr. Mohit P. Tahiliani, National Institute of Technology Karnat...

متن کامل

Initialization Protocols for IEEE 802.11-Based Ad Hoc Networks

Leader election and initialization are two fundamental problems in mobile ad hoc networks (MANET s). The leader can serve as a coordinator in the MANET s and the initialization protocol can assign each host a unique and short id. As we know that none of the research on initialization for IEEE 802.11-basedMANET s has been done. Here, we proposed two contention-based leader election and initializ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013